Statistical Microcomputing—Like it is

A statistical software package is a collaborative effort between a program's authors and users. When statistical analysis took place exclusively on mainframe computers, the entire statistical community was served by some three to six major packages, which helped to ensure that program errors would be quickly uncovered and corrected. The current trend toward performing statistical analysis on microcomputers has resulted in an explosion of software of varying quality, with more than 200 packages for the IBM PC alone. Since all of these programs are competing for the same base of knowledgeable users, the number of sophisticated users per package is dramatically less than for mainframe packages; the net result is that problems in any particular package are more likely to go unnoticed and uncorrected. For example, the most widely used shareware package contains major errors that should cause it to be rejected out of hand, and three best-selling packages analyze unbalanced two-factor experiments using an approximate technique originally developed for hand calculation. Several strategies are offered to help author and user reveal any problems that might be present in their software.     

Principal point classification: Applications to differentiating drug and placebo responses in longitudinal studies

Principal points are cluster means for theoretical distributions. A discriminant methodology based on principal points is introduced. The principal point classification method is useful in clinical trials where the goal is to distinguish and differentiate between different treatment effects. Particularly, in psychiatric studies where placebo response rates can be very high, the principal point classification is illustrated to distinguish specific drug responders from non-specific placebo responders.     

Comparison between method of moments and entropy regularization algorithm applied to parameter estimation for mixed-Weibull distribution

Mixed-Weibull distribution has been used to model a wide range of failure data sets, and in many practical situations the number of components in a mixture model is unknown. Thus, the parameter estimation of a mixed-Weibull distribution is considered and the important issue of how to determine the number of components is discussed. Two approaches are proposed to solve this problem. One is the method of moments and the other is a regularization type of fuzzy clustering algorithm. Finally, numerical examples and two real data sets are given to illustrate the features of the proposed approaches.     

Some applications of nonlinear and non-Gaussian state–space modelling by means of hidden Markov models

Nonlinear and non-Gaussian state–space models (SSMs) are fitted to different types of time series. The applications include homogeneous and seasonal time series, in particular earthquake counts, polio counts, rainfall occurrence data, glacial varve data and daily returns on a share. The considered SSMs comprise Poisson, Bernoulli, gamma and Student-t distributions at the observation level. Parameter estimations for the SSMs are carried out using a likelihood approximation that is obtained after discretization of the state space. The approximation can be made arbitrarily accurate, and the approximated likelihood is precisely that of a finite-state hidden Markov model (HMM). The proposed method enables us to apply standard HMM techniques. It is easy to implement and can be extended to all kinds of SSMs in a straightforward manner.     

Improving variance function estimation in semiparametric longitudinal data analysis

We propose an efficient and robust method for variance function estimation in semiparametric longitudinal data analysis. The method utilizes a local log‐linear approximation for the variance function and adopts a generalized estimating equation approach to account for within subject correlations. We show theoretically and empirically that our method outperforms estimators using working independence that ignores the correlations. The Canadian Journal of Statistics 39: 656–670; 2011. © 2011 Statistical Society of Canada     

On some mixture models based on the Birnbaum-Saunders distribution and associated inference

In this paper, we consider three different mixture models based on the Birnbaum-Saunders (BS) distribution, viz., (1) mixture of two different BS distributions, (2) mixture of a BS distribution and a length-biased version of another BS distribution, and (3) mixture of a BS distribution and its length-biased version. For all these models, we study their characteristics including the shape of their density and hazard rate functions. For the maximum likelihood estimation of the model parameters, we use the EM algorithm. For the purpose of illustration, we analyze two data sets related to enzyme and depressive condition problems. In the case of the enzyme data, it is shown that Model 1 provides the best fit, while for the depressive condition data, it is shown all three models fit well with Model 3 providing the best fit.     

Truncation invariant copulas and a testing procedure

ABSTRACT

The class of bivariate copulas that are invariant under truncation with respect to one variable is considered. A simulation algorithm for the members of the class and a novel construction method are presented. Moreover, inspired by a stochastic interpretation of the members of such a class, a procedure is suggested to check whether the dependence structure of a given data set is truncation invariant. The overall performance of the procedure has been illustrated on both simulated and real data.     

A note on the monotonicity of the ES algorithm

In the study of the robust nonparametric regression problem, Oh et al. [The role of pseudo data for robust smoothing with application to wavelet regression, Biometrika 94 (2007), pp. 893–904] developed and named the ES algorithm. In the event that the ES algorithm converges, the robust estimator can be obtained through a sequence of conventional penalized least-squares estimates, the computation of which is fast and straightforward. However, the convergence of the ES algorithm was not established theoretically in Oh et al. In this note, we show that under a certain simple condition, the ES algorithm is monotonic. In particular, the ES algorithm does converge globally in the setting of Oh et al.     

Inference for the scale parameter of lifetime distribution of k-unit parallel system based on progressively censored data

In this paper, inference for the scale parameter of lifetime distribution of a k-unit parallel system is provided. Lifetime distribution of each unit of the system is assumed to be a member of a scale family of distributions. Maximum likelihood estimator (MLE) and confidence intervals for the scale parameter based on progressively Type-II censored sample are obtained. A β-expectation tolerance interval for the lifetime of the system is obtained. As a member of the scale family, half-logistic distribution is considered and the performance of the MLE, confidence intervals and tolerance intervals are studied using simulation.     

Optimal determination of the parameters of some biased estimators using genetic algorithm

In this paper, some new algorithms for estimating the biasing parameters of the ridge, Liu and two-parameter estimators are introduced with the help of genetic algorithm (GA). The proposed algorithms are based on minimizing some statistical measures such as mean square error (MSE), mean absolute error (MAE) and mean absolute prediction error (MAPE). At the same time, the new algorithms allow one to keep the condition number and variance inflation factors to be less than or equal to ten by means of the GA. A numerical example is presented to show the utility of the new algorithms. In addition, an extensive Monte Carlo experiment is conducted. The numerical findings prove that the proposed algorithms enable to eliminate the problem of multicollinearity and minimize the MSE, MAE and MAPE.